Asymptotically Dense Spherical Codes—Part I: Wrapped Spherical Codes

A new class of spherical codes called wrapped spherical codes is constructed by “wrapping” any sphere packing in Euclidean space onto a finite subset of the unit sphere in one higher dimension. The mapping preserves much of the structure of , and unlike previously proposed maps, the density of wrapped spherical codes approaches the density of as the minimum distance approaches zero. We show that this implies that the asymptotically maximum spherical coding density is achieved by wrapped spherical codes whenever is the densest possible sphere packing.